منابع مشابه
Club Formation Games with Farsighted Agents
Modeling club structures as bipartite networks, we formulate the problem of club formation as a game of network formation and identify those club networks that are stable if agents behave farsightedly in choosing their club memberships. Using the farsighted core as our stability notion, we show that if agents’ payoffs are single-peaked and agents agree on the peak club size (i.e., agents agree ...
متن کاملCoalition Formation among Farsighted Agents
A set of coalition structures P is farsightedly stable (i) if all possible deviations from any coalition structure p belonging to P to a coalition structure outside P are deterred by the threat of ending worse off or equally well off, (ii) if there exists a farsighted improving path from any coalition structure outside the set leading to some coalition structure in the set, and (iii) if there i...
متن کاملHouse Allocation with Overlapping Agents: A Dynamic Mechanism Design Approach
Many real-life applications of house allocation problems are dynamic. For example, in the case of on-campus housing for college students, each year freshmen apply to move in and graduating seniors leave. Each student stays on campus for a few years only. A student is a “newcomer” in the beginning and then becomes an “existing tenant.” Motivated by this observation, we introduce a model of house...
متن کاملMechanism design for software agents with complete information
We investigate the mechanism design problem when the agents and the mechanism have computational restrictions. In particular, we examine how results in the mechanism design literature are affected when the social choice rule requires the mechanism to solve a computationally difficult optimization problem. Both dominant strategy and Nash implementation are considered for a multiagent version of ...
متن کاملMechanism design for set cover games with selfish element agents
In this paper we study the set cover games when the elements are selfish agents, each of which has a privately known valuation of receiving the service from the sets, i.e., being covered by some set. Each set is assumed to have a fixed cost. We develop several approximately efficient strategyproof mechanisms that decide, after soliciting the declared bids by all elements, which elements will be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2019
ISSN: 1556-5068
DOI: 10.2139/ssrn.3402400